Perturbation bounds for Mostow's decomposition and the bipolar decomposition
نویسندگان
چکیده
منابع مشابه
Perturbation Bounds for the Polar Decomposition
Let M n (F) denote the space of matrices over the eld F. Given A2 M n (F) deene jAj (A A) 1=2 and U(A) AjAj ?1 assuming A is nonsingular. Let 1 (A) 2 (A) n (A) 0 denote the ordered singular values of A. We obtain majorization results relating the singular values of U(A + A) ? U(A) and those of A and A. In particular we show that if A; A2 M n (R) and 1 ((A) < n (A) then for any unitarily invaria...
متن کاملSome New Perturbation Bounds for the Generalized Polar Decomposition
The changes in the unitary polar factor under both multiplicative and additive perturbation are studied. A multiplicative perturbation bound and a new additive perturbation bound, in which a different measure of perturbation is introduced, are presented. AMS subject classification (2000): 15A18, 15A23, 65F35.
متن کاملRelative and Absolute Perturbation Bounds for Weighted Polar Decomposition
Let Cm×n, Cm×n r , C m ≥ , C m > , and In denote the set of m × n complex matrices, subset of Cm×n consisting of matrices with rank r, set of the Hermitian nonnegative definite matrices of order m, subset of C ≥ consisting of positive-definite matrices and n × n unit matrix, respectively. Without specification, we always assume that m > n >max{r, s} and the given weight matrices M ∈ C > ,N ∈ C ...
متن کاملSome new perturbation bounds of generalized polar decomposition
Some new perturbation bounds of the positive (semi) definite polar factor and the (sub) unitary polar factor for the (generalized) polar decomposition under the general unitarily invariant norm and the spectral norm are presented. By applying our new bounds to the weighted cases, the known perturbation bounds for the weighted polar decomposition are improved. 2014 Elsevier Inc. All rights reser...
متن کاملDecomposition Bounds for Marginal MAP
Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and convergent variational algorithms, such as dual decomposition, exist. In this work, we generalize dual decomposition to a generic power sum inference task, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2017
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.03.027